Dynamic demand estimation and microscopic traffic simulation of a university campus transportation network

Abstract

This article documents the authors' experience with the modeling, simulation, and analysis of a university transportation system, using the TRansportation ANalysis and SIMulation System (TRANSIMS). The processes of data preparation and network coding are described, followed by the algorithm developed to estimate the dynamic 24-hour demand, which includes a procedure for estimating the ‘desirability’ of the different parking lots from readily available data. The dynamic demand estimation algorithm is validated by comparing estimated and observed parking lot occupancies, where it is shown that the algorithm is capable of replicating observed results. Finally, an example is included to demonstrate how the developed model can be used in campus transportation planning. Besides serving as a first case study for using TRANSIMS to model a university campus, the study's contributions include the development of a procedure for parking lot desirability ranking and a practical procedure for estimating dynamic demand on university campuses.     

Quasi-dynamic estimation of o–d flows from traffic counts: Formulation,statistical validation and performance analysis on real data

The paper proposes a “quasi-dynamic” framework for estimation of origin–destination (o–d) flow from traffic counts, under the assumption that o–d shares are constant across a reference period, whilst total flows leaving each origin vary for each sub-period within the reference period. The advantage of this approach over conventional within-day dynamic estimators is that of reducing drastically the number of unknowns given the same set of observed time-varying traffic counts. Obviously, the gain in accuracy depends on how realistic is the underlying assumption that total demand levels vary more rapidly over time than o–d shares. Firstly, the paper proposes a theoretical specification of the quasi-dynamic estimator. Subsequently, it proposes empirical and statistical tests to check the quasi-dynamic assumption and then compares the performances of the quasi-dynamic estimator of o–d flows with both classical off-line simultaneous dynamic estimators and on-line recursive Kalman filter-based estimators. Experiments are carried out on the real test site of A4–A23 motorways in North-Eastern Italy. Results confirm the acceptability of the assumption of quasi-dynamic o–d flows, even under the hypothesis of constant distribution shares for the whole day and show that the quasi-dynamic estimator outperforms significantly the simultaneous estimator. Data also suggest that using the quasi-dynamic estimates instead of the simultaneous estimates as historical o–d flows improves significantly the performances of the Kalman filter, which strongly depends of the quality of the seed o–d flows. In addition, it is shown that the aggregation of quasi-dynamic o–d estimates across subsequent time slices represents also the most effective way to obtain o–d estimates for larger time horizons (e.g. hourly estimates). Finally, a validation based on an hold-out sample of link flows (i.e. counts not used as inputs in the o–d estimation/updating process) revealed the quasi-dynamic estimator to be overall more robust and effective with respect to the other tested estimators.     

A practical capacity model of a single track line

The paper presents a model for determining the practical capacity of a single track line, i.e. the maximum number of trains which can be run along it in a time unit under the condition that each train enters its bottleneck segment with a definite delay.

The input data used in the model are: geometrical characteristics of the bottleneck segment of the line under study, the intensity and structure of demand expressed by a number of trains which are run over the line in a given time unit, the scenario of traffic running over the line under study and the operational tactics of individual train categories processing on the bottleneck segment.

(Two tactics can be applied in the train processing on the line under study; first, the trains of individual categories are given different priorities in the processing, and second, all the trains have the same priority).

The output results of the model are average delays of trains of each category occurring within the train processing performed on the bottleneck segment of the line under study in a given time unit.     

浅谈公路工程估算编制的新规则

新的《公路工程基本建设项目投资估算编制办法》和《公路工程估算指标》自2012年1月1日正式实施。取代1996编办和指标,针对估算编制的新规则,分析总结新旧差异,为以后估算编制工作提供指导。     

Estimating travel time functions for urban roads: options and issues

Travel time functions specify the relationship between the travel time on a road and the volume of traffic on the road. Until recently, the parameters of travel time functions were rarely estimated in practice; however, a compelling case can be made for the empirical examination of these functions. This paper reviews, and qualitatively evaluates, a range of options for developing a set of travel time functions. A hierarchy of travel time functions is defined based on four levels of network detail: area, corridor, route and link. This hierarchy is illustrated by considering the development of travel time functions for Adelaide. Alternative sources of data for estimating travel time functions are identified.

In general, the costs and benefits increase as the travel time functions are estimated at finer levels of network detail. The costs of developing travel time functions include data acquisition costs and analysis costs. The benefits include the potential for reducing prediction errors, the degree of application flexibility and the policy sensitivity of the travel time functions.     

Use of combinatorial auctions in the railway industry: Can the “invisible hand” draw the railway timetable?

Rail capacity is currently administratively allocated in Europe, whereas the economic literature has often contemplated the opportunity of introducing market mechanisms, auctions in particular, into this industry. This article tries to fill the gap between practice and theory. It first describes the properties of rail capacity (rigidity and non-homogeneity) and shows that because of its very nature, this capacity must be allocated through combinatorial auctions. As identified by the economic literature, using combinatorial auctions introduces a lot of complexity (winner determination and information burden) into the allocation process. To deal with this complexity, some form of centralized planning is necessary to design the right market mechanisms and to allocate capacity. This could have strong consequences on the current deregulation process.     

A competing Markov model for cracking prediction on civil structures

Cracks on the surface of civil structures (e.g. pavement sections, concrete structures) progress in several formations and under different deterioration mechanisms. In monitoring practice, it is often that cracking type with its worst damage level is selected as a representative condition state, while other cracking types and their damage levels are neglected in records, remaining as hidden information. Therefore, the practice in monitoring has a potential to conceal with a bias selection process, which possibly result in not optimal intervention strategies. In overcoming these problems, our paper presents a non-homogeneous Markov hazard model, with competing hazard rates. Cracking condition states are classified in three types (longitudinal crack, horizontal crack, and alligator crack), with three respective damage levels. The dynamic selection of cracking condition states are undergone a competing process of cracking types and damage levels. We apply a numerical solution using Bayesian estimation and Markov Chain Monte Carlo method to solve the problem of high-order integration of complete likelihood function. An empirical study on a data-set of Japanese pavement system is presented to demonstrate the applicability and contribution of the model.     

The train platforming problem: The infrastructure management company perspective

If railway companies ask for station capacity numbers, their underlying question is in fact one about the platformability of extra trains. Train platformability depends not only on the infrastructure, buffer times, and the desired departure and arrival times of the trains, but also on route durations, which depend on train speeds and lengths, as well as on conflicts between routes at any given time. We consider all these factors in this paper. We assume a current train set and a future one, where the second is based on the expected traffic increase through the station considered. The platforming problem is about assigning a platform to each train, together with suitable in- and out-routes. Route choices lead to different route durations and imply different in-route-begin and out-route-end times. Our module platforms the maximum possible weighted sum of trains in the current and future train set. The resulting number of trains can be seen as the realistic capacity consumption of the schedule. Our goal function allows for current trains to be preferably allocated to their current platforms.Our module is able to deal with real stations and train sets in a few seconds and has been fully integrated by Infrabel, the Belgian Infrastructure Management Company, in their application called Ocapi, which is now used to platform existing and projected train sets and to determine the capacity consumption.     

基于应力松弛试验用有限元预估车辙

为了使车辙预估变得更为简便,提出一种基于应力松弛试验的改进的有限元车辙预估方法。研究结果表明：不仅从粘弹性力学的角度分析,应力松弛试验在理论上与Maxwell模型具有一致性,而且实例计算结果也验证了此方法的可行性。该方法便于不熟悉本构理论的工程人员进行车辙预估。